#include <bits/stdc++.h>

using namespace std;

const int N = 1010;
int f[N], a[N], g[N];
int n;

int main()
{
    cin >> n;
    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i];
    }
    for (int i = 1; i <= n; ++i)
    {
        f[i] = 1;
        for (int j = 1; j < i; ++j)
        {
            if (a[j] < a[i])
                f[i] = max(f[i], f[j] + 1);
        }
    }
    for (int i = n; i > 0; --i)
    {
        g[i] = 1;
        for (int j = n; j > i; --j)
        {
            if (a[i] > a[j])
            {
                g[i] = max(g[i], g[j] + 1);
            }
        }
    }
    int ret = 0;
    for (int i = 1; i <= n; ++i)
    {
        ret = max(ret, f[i] + g[i] - 1);
    }
    cout << n - ret << endl;
    return 0;
}